A Class Representative Model for Pure Parsimony Haplotyping

نویسندگان

  • Daniele Catanzaro
  • Alessandra Godi
  • Martine Labbé
چکیده

Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of many fine-scale genetic data. Its application fields range from mapping of complex disease genes to inferring population histories, passing through designing drugs, functional genomics and pharmacogenetics. The literature proposes several criteria for haplotyping populations, each of them characterized by biological motivations. One of the most important haplotyping criteria is the parsimony which consists of finding the minimum number of haplotypes necessary to explain a given set of genotypes. Parsimonious haplotype estimation is a NP-Hard problem for which the literature has proposed several Integer Programming (IP) models. Here we describe a new polynomial-sized IP model based on the concept of class representatives, already used for the coloring problem. We propose valid inequalities to strengthen our model and show, through computational experiments, that our model outperforms the best IP models currently known in literature.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Class Representative Model for Pure Parsimony Haplotyping under Uncertain Data

The Pure Parsimony Haplotyping (PPH) problem is a NP-hard combinatorial optimization problem that consists of finding the minimum number of haplotypes necessary to explain a given set of genotypes. PPH has attracted more and more attention in recent years due to its importance in analysis of many fine-scale genetic data. Its application fields range from mapping complex disease genes to inferri...

متن کامل

Approximation algorithms for the minimum rainbow subgraph problem

Our research was motivated by the pure parsimony haplotyping problem: Given a set G of genotypes, the haplotyping problem consists in finding a set H of haplotypes that explains G. In the pure parsimony haplotyping problem (PPH) we are interested in finding a set H of smallest possible cardinality. The pure parsimony haplotyping problem can be described as a graph colouring problem as follows: ...

متن کامل

1 Haplotype Inference

Fresh Pond Research Institute 1.1 Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Introduction to Variation, SNPs, Genotypes, and Haplotypes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1-2 The Biological Problem • The Computational Problems • The Need for a Genetic Model • Two Major Ap...

متن کامل

The pure parsimony haplotyping problem: overview and computational advances

Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of many fine-scale genetic data. Its application fields range from mapping of complex disease genes to inferring population histories, passing through designing drugs, functional genomics and pharmacogenetics. The literatu...

متن کامل

Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems

Haplotyping, also known as haplotype phase prediction, is the problem of predicting likely haplotypes based on genotype data. This problem, which has strong practical applications, can be approached using both statistical as well as combinatorial methods. While the most direct combinatorial approach, maximum parsimony, leads to NP-complete problems, the perfect phylogeny model proposed by Gusfi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • INFORMS Journal on Computing

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2010